Hierarchical marginal models with latent uncertainty
نویسندگان
چکیده
منابع مشابه
Document Generation with Hierarchical Latent Tree Models
In most probabilistic topic models, a document is viewed as a collection of tokens and each token is a variable whose values are all the words in a vocabulary. One exception is hierarchical latent tree models (HLTMs), where a document is viewed as a binary vector over the vocabulary and each word is regarded as a binary variable. The use of word variables allows the detection and representation...
متن کاملLearning Hierarchical Latent Class Models
Hierarchical latent class (HLC) models generalize latent class models. As models for cluster analysis, they suit more applications than the latter because they relax the often untrue conditional independence assumption. They also facilitate the discovery of latent causal structures and the induction of probabilistic models that capture complex dependencies and yet have low inferential complexit...
متن کاملHierarchical Network Models for Education Research: Hierarchical Latent Space Models
Intervention studies in school systems are sometimes aimed not at changing curriculum or classroom technique, but rather at changing the way that teachers, teaching coaches and administrators in schools work with one another—in short, changing the professional social networks of educators. Current methods of social network analysis are ill-suited to modeling the multiple partially-exchangeable ...
متن کاملHierarchical Models, Marginal Polytopes, and Linear Codes
In this paper, we explore a connection between binary hierarchical models, their marginal polytopes and codeword polytopes, the convex hulls of linear codes. The class of linear codes that are realizable by hierarchical models is determined. We classify all full dimensional polytopes with the property that their vertices form a linear code and give an algorithm that determines them.
متن کاملStructural EM for Hierarchical Latent Class Models
Hierarchical latent class (HLC) models are tree-structured Bayesian networks where leaf nodes are observed while internal nodes are not. This paper is concerned with the problem of learning HLC models from data. We apply the idea of structural EM to a hill-climbing algorithm for this task described in an accompanying paper (Zhang et al. 2003) and show empirically that the improved algorithm can...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Scandinavian Journal of Statistics
سال: 2018
ISSN: 0303-6898,1467-9469
DOI: 10.1111/sjos.12366